Direct Computation of Type-II Discrete Hartley Transform
نویسندگان
چکیده
منابع مشابه
Relation between Type-II Discrete Sine Transform and Type -I Discrete Hartley Transform
In this paper, a relation for finding type-II discrete sine transform (DST) from type-I discrete Hartley transform (DHT) has been derived. The transform length N is taken as even. Using this relation, the (N 1) output components of DST can be realized from DHT. The DHT is one of the transforms used for converting data in time domain into frequency domain using only real values.
متن کاملDiscrete Hartley transform based multicarrier modulation
This paper presents a real-valued discrete multicamer modulation approach that is based on the use of the discrete Hartley transform (DHT) and its inverse (IDHT) to perform the modulation and demodulation operations. Since the DHT and IDHT definitions are identical, we can use the same hardware or program to implement the modulator and demodulator of the proposed multicarrier method. As compare...
متن کاملA Separable Two - Dimensional Discrete Hartley Transform Andrew
Bracewell has proposed the Discrete Hartley Transform (DHT) as a substitute for the Discrete Fourier Transform (DFT), particularly as a means of convolution (R. N. Bracewell, "Discrete Hartley transform," Journal of the Optical Society of Arnerica, vol. 73, pp. 1832-1835, 1983). Here we show that the most natural extension of the DHT to two dimensions fails to be separable in the two dimensions...
متن کاملA Factorization Scheme for Some Discrete Hartley Transform Matrices
Discrete transforms such as the discrete Fourier transform (DFT) and the discrete Hartley transform (DHT) are important tools in numerical analysis, signal processing, and statistical methods. The successful application of transform techniques relies on the existence of efficient fast transforms. In this paper some fast algorithms are derived. The theoretical lower bound on the multiplicative c...
متن کاملRadix-2 Algorithms for Implementation of Type-II Discrete Cosine Transform and Discrete Sine Transform
In this paper radix-2 algorithms for computation of type-II discrete cosine transform (DCT) and discrete sine transform (DST) of length N = 2 (n ≥ 2) are presented. The DCT/DST can be computed from two DCT/DST sequences, each of length N/2. The odd-indexed output components of DCT/DST can be realized using simple recursive relations. The proposed algorithms require a reduced number of arithmeti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Signal Processing Letters
سال: 2007
ISSN: 1070-9908
DOI: 10.1109/lsp.2006.888362